Centralized broadcast in multihop radio networks
نویسندگان
چکیده
منابع مشابه
Centralized broadcast in multihop radio networks
We show that for any radio network there exists a schedule of a broadcast whose time is O(D+ log5 n), where D is the diameter and n is the number of nodes. (This result implies an optimal broadcast to networks with D =Ω(log5 n).) We present a centralized randomized polynomial time algorithm that given a network and a source, outputs a schedule for broadcasting the message from the source to the...
متن کاملCentralized asynchronous broadcast in radio networks
We study asynchronous broadcasting in packet radio networks. A radio network is represented by a directed graph, in which one distinguished source node stores a message that needs to be disseminated among all the remaining nodes. An asynchronous execution of a protocol is a sequence of events, each consisting of simultaneous deliveries of messages. The correctness of protocols is considered for...
متن کاملEnergy-efficient broadcast in multihop cognitive radio networks
Broadcast is an important operation in Cognitive Radio Networks (CRNs). How to achieve broadcast in an energy-efficient way is important since users in CRNs are usually battery-powered. Existing single-channel broadcast mechanisms are not suitable for CRNs because multiple channels can be used in a CRN. Most existing multi-channel broadcast schemes rely on a common control channel (CCC) to supp...
متن کاملDistributed Algorithms in Multihop Broadcast Networks
The paper addresses the problem of solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n lg(n)) message transmission complexity. Our distributed solution uses a special form of the propagation of information with feedback (PIF) building block tuned to t...
متن کاملAsynchronous Broadcast in Radio Networks
We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node. The timing of arrivals of messages is controlled by adversaries. We consider three different adversaries. The edge adversary can have a transmitted message delivered at different times to different recipients. The crash adver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 2003
ISSN: 0196-6774
DOI: 10.1016/s0196-6774(02)00292-4